|
Boole's expansion theorem, often referred to as the Shannon expansion or decomposition, is the identity: , where is any Boolean function and and are with the argument equal to and to respectively. The terms and are sometimes called the positive and negative Shannon cofactors, respectively, of with respect to . These are functions, computed by restrict operator, and (see valuation (logic) and partial application). It has been called the "fundamental theorem of Boolean algebra".〔Paul C. Rosenbloom, ''The Elements of Mathematical Logic'', 1950, p. 5〕 Besides its theoretical importance, it paved the way for binary decision diagrams, satisfiability solvers, and many other techniques relevant to computer engineering and formal verification of digital circuits. ==Statement of the theorem== A more explicit way of stating the theorem is- : Proof for the statement follows from direct use of mathematical induction, from the observation that and expanding a 2-ary and n-ary Boolean functions identically. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Boole's expansion theorem」の詳細全文を読む スポンサード リンク
|